A Tutorial on Binary Space Partitioning Trees
نویسنده
چکیده
منابع مشابه
CAD Model Acquisition using Binary Space Partitioning Trees
This paper discusses an approach to automating CAD model acquisition by creating Binary Space Partitioning (BSP) trees from laser range data. Distinct views of the object, each represented by a BSP tree, are then merged using set operations on the trees. BSP trees have proven their utility in 3-D modeling, graphics and image processing, and their tree structure allows efficient algorithms to be...
متن کاملBinary Space Partitioning (BSP) Trees
A binary space partitioning (bsp) tree represents a recursive, hierarchical subdivision of d-dimensional space into convex subspaces. BSP trees provide a computational representation of space that provides both a search structure and a representation of geometry. Constructing a bsp tree consists of partitioning a subspace by means of a hyperplane, which intersects the interior of that subspace,...
متن کاملRectilinear Bsp Trees for Preferred Ray Sets
Rectilinear Binary Space Partitioning (BSP) trees are often used for solving various types of range searching problems including ray shooting. We propose a novel method for construction of rectilinear BSP trees for a preferred set of ray shooting queries. Particularly, we study ray sets formed by fixing either the direction or the origin of rays. We analyse and discuss the properties of constru...
متن کاملWhich Space Partitioning Tree to Use for Search - Summary
Trees like binary-space-partitioning trees, kd-trees, principal axis trees and random projection trees are used to answer the question ”which tree to use for nearest-neighbor search?.” This paper deals with the influence of the vector quantization performance of the trees on the search performance and the margins of the partitions in these trees. Theoretical results show that both factors have ...
متن کاملBinary space partitioning trees: a multiresolution approach
Space partitioning techniques are a useful means of organizing geometric models into data structures. Such data structures provide easy and efficient access to a wide range of computer graphics and visualization applications like real-time rendering of large data bases, collision detection, point classification, etc. Binary Space Partitioning (BSP) trees are one of the most successful space par...
متن کامل